Background: The aim of the study was to discuss on the influential factors of the mode of classification of partition management in the emergency triage.Method: Retrospectively analyzing the effects of emergency triage of 156 cases who adopted the classification partition management mode during Oct 2014 to Oct 2015 in Xuzhou Central Hospital (Xuzhou, Jiangsu Province, China). They were divided into triage success group of 108 cases and triage failure group of 48 cases. Comparing the single factor analysis and multi-factor analysis, and selecting possible influential factors.Result: According to the single factor analysis, for the patients who came to the doctor in the daytime and working days, the higher education degree and compliance they had, the faster the back-show time of emergency inspect and check came back, the more comprehensive the body examination and disease history taking were done, the simpler the disease condition was, the higher triage success rate they received. Compared to the emergency observation time be-tween two groups, the difference was not statistically significant. According to the multi-factor analysis, the emergency check and examination back-show time, the comprehensive degree of body examination and disease history taking and the complexity degree of disease could be the independent risk factors for triage success.Conclusion: Simplify the examination procedure, improve the efficiency of back-show and acquire detail disease in-formation are important methods for the improvement of triage success.

Nowadays, the fundamental role of having a purpose for life in physical and mental health has been confirmed. According to victor frankl, presence of a purpose in life gives life a meaning and increases resilience against pains and traumas. The importance of the purpose in life construct reveals the need for a reliable and valid tool to measure it. Crumbaugh and Maholick's purpose in life questionnaire is the first and one of the most applied tools for the assessment of life's purposefulness. The aim of this research is to determine the factor structure of purpose in life questionnaire. The questionnaire was administered on 206 students who were selected through random stratified sampling at Ferdowsi University of Mashhad. Exploratory factor analysis showed that there are two factors "comprehension" and "purpose" and this finding were confirmed by confirmatory factor analysis. Altogether results of this research showed factor validity of the purpose in life questionnaire with a two factor pattern

In a linear optimization problem, objective function, coefficients matrix, and the right-hand side might be perturbed with distinct parameters independently. For such a problem, we are interested in finding the region that contains the origin, and the optimal partition remains invariant. A computational methodology is presented here for detecting the boundary of this region. The cases where perturbation occurs only in the coefficients matrix and right-hand side vector or the objective function are specified as special cases. The findings are illustrated with some simple examples.

For a graph $G$ on $v(G)$ vertices let $m_k(G)$ denote the number of matchings of size $k$‎, ‎and consider the partition function $M_{G}(\lambda)=\sum_{k=0}^nm_k(G)\lambda^k$‎. ‎In this paper we show that if $G$ is a $d$--regular graph and $0<\lambda<(4d)^{-2}$‎, ‎then‎ ‎$$\frac{1}{v(G)}\ln M_G(\lambda)>\frac{1}{v(K_{d+1})}\ln M_{K_{d+1}}(\lambda).$$‎ ‎The same inequality holds true if $d=3$ and $\lambda<0.3575$‎. ‎More precise conjectures are also given‎.

This paper is about metric and partition dimension of a flower and a pencil graph. A metric dimension of G, denoted by dim(G), is the minimum cardinality of any resolving set of G. A partition dimension of G, denoted by pd(G), is the minimum number of sets in any resolving k-ordered partition for G. Here we give the exact value of the metric dimension of a flower graph fm×n for m ∈ {3, 4} and a pencil graph Pcm for any integer m ≥ 2. We also give the partition dimension of fm×n for m ∈ {3, 4, 5} and Pcm for any integer m ≥ 2.

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems. Due to the complexity of reducing teleportation costs in multi-partition quantum computing, a two-level optimization is proposed. In the first level, using graph partition methods, the quantum circuit is divided into k partitions. Secondly, using a series of proposed rules and functions, the number of teleportations for the partitioned quantum circuit is improved. In previous work, only optimization at the first level has been conisdered for the distributed quantum circuits. The implementation results show that the cost of teleportation in the proposed algorithm has been improved compared to previous work on benchmark circuits.